全文获取类型
收费全文 | 5258篇 |
免费 | 428篇 |
国内免费 | 342篇 |
专业分类
化学 | 208篇 |
晶体学 | 2篇 |
力学 | 31篇 |
综合类 | 141篇 |
数学 | 5385篇 |
物理学 | 261篇 |
出版年
2024年 | 10篇 |
2023年 | 99篇 |
2022年 | 145篇 |
2021年 | 123篇 |
2020年 | 205篇 |
2019年 | 234篇 |
2018年 | 226篇 |
2017年 | 202篇 |
2016年 | 128篇 |
2015年 | 95篇 |
2014年 | 180篇 |
2013年 | 457篇 |
2012年 | 197篇 |
2011年 | 309篇 |
2010年 | 305篇 |
2009年 | 455篇 |
2008年 | 401篇 |
2007年 | 285篇 |
2006年 | 332篇 |
2005年 | 227篇 |
2004年 | 207篇 |
2003年 | 177篇 |
2002年 | 171篇 |
2001年 | 153篇 |
2000年 | 108篇 |
1999年 | 101篇 |
1998年 | 93篇 |
1997年 | 66篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 27篇 |
1992年 | 26篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6028条查询结果,搜索用时 125 毫秒
91.
《Discrete Mathematics》2023,346(4):113285
In this paper, we investigate the ratio of the numbers of odd and even cycles in outerplanar graphs. We verify that the ratio generally diverges to infinity as the order of a graph diverges to infinity. We also give sharp estimations of the ratio for several classes of outerplanar graphs, and obtain a constant upper bound of the ratio for some of them. Furthermore, we consider similar problems in graphs with some pairs of forbidden subgraphs/minors, and propose a challenging problem concerning claw-free graphs. 相似文献
92.
Zoltán Buczolich Gunther Leobacher Alexander Steinicke 《Mathematische Nachrichten》2023,296(10):4778-4805
We construct a Hölder continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We conclude that this function has impermeable graph—one of the key concepts introduced in this paper—and we present further examples of functions both with permeable and impermeable graphs. Moreover, we show that typical (in the sense of Baire category) continuous functions have permeable graphs. The first example function is subsequently used to construct an example of a continuous function on the plane which is intrinsically Lipschitz continuous on the complement of the graph of a Hölder continuous function with impermeable graph, but which is not Lipschitz continuous on the plane. As another main result, we construct a continuous function on the unit interval which coincides in a set of Hausdorff dimension 1 with every function of total variation smaller than 1 which passes through the origin. 相似文献
93.
94.
设图$G$,其中边集为$E(G)$,顶点集$V(G)$.反对称分割指数被定义为$ISDD(G)=\sum_{uv \in E(G)}\dfrac{d_ud_v}{d_u^2+d_v^2}$,其中$d_u$, $d_v$分别为顶点$u,v$的度.化学树就是顶点的度不超过4的树.在本文中,我们刻画出具有最小反对称分割指数的$n$阶化学树. 相似文献
95.
给定图$G$,对图$G$的每条边确定一个方向,称为$G$的定向图$G^\sigma$, $G$称为$G^\sigma$的基础图. $G^\sigma$的斜邻接矩阵$S(G^\sigma)$是反对称矩阵,其特征值是0或纯虚数. $S(G^\sigma)$所有特征值的$k$次幂之和称为$G^\sigma$的$k$阶斜谱矩,其中$k$是非负整数.斜谱矩序列可用于对图进行排序.本文主要研究定向树和定向单圈图的斜谱矩,并对这两类图的斜谱矩序列依照字典序进行排序.首先确定了直径为$d$的树作为基础图的所有定向树中,斜谱矩序最大的$2\lfloor\frac{d}{4}\rfloor$个图; 然后确定以围长为$g$的单圈图作为基础图的所有定向单圈图中, 斜谱矩序最大的$2\lfloor\frac{g}{4}\rfloor+1$个图. 相似文献
96.
令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图. 相似文献
97.
Yanguang Li 《Journal of Dynamics and Differential Equations》2003,15(4):699-730
For finite-dimensional maps and periodic systems, Palmer rigorously proved Smale horseshoe theorem using shadowing lemma in 1988 [20]. For infinite-dimensional maps and periodic systems, such a proof was completed by Steinlein and Walther in 1990 [30], and Henry in 1994 [9]. For finite-dimensional autonomous systems, such a proof was accomplished by Palmer in 1996 [17]. For infinite-dimensional autonomous systems, the current article offers such a proof. First we prove an Inclination Lemma to set up a coordinate system around a pseudo-orbit. Then we utilize graph transform and the concept of persistence of invariant manifold, to prove the existence of a shadowing orbit. 相似文献
98.
99.
Khodakhast Bibak 《International journal of quantum chemistry》2013,113(8):1209-1212
For a graph G, a “spanning tree” in G is a tree that has the same vertex set as G. The number of spanning trees in a graph (network) G, denoted by t(G), is an important invariant of the graph (network) with lots of decisive applications in many disciplines. In the article by Sato (Discrete Math. 2007, 307, 237), the number of spanning trees in an (r, s)‐semiregular graph and its line graph are obtained. In this article, we give short proofs for the formulas without using zeta functions. Furthermore, by applying the formula that enumerates the number of spanning trees in the line graph of an (r, s)‐semiregular graph, we give a new proof of Cayley's Theorem. © 2013 Wiley Periodicals, Inc. 相似文献
100.
Nonequilibrium free energy and information flow of a double quantum-dot system with Coulomb coupling 下载免费PDF全文
Zhiyuan Lin 《中国物理 B》2021,30(8):80501-080501
We build a double quantum-dot system with Coulomb coupling and aim at studying connections among the entropy production, free energy, and information flow. By utilizing concepts in stochastic thermodynamics and graph theory analysis, Clausius and nonequilibrium free energy inequalities are built to interpret local second law of thermodynamics for subsystems. A fundamental set of cycle fluxes and affinities is identified to decompose two inequalities by using Schnakenberg's network theory. Results show that the thermodynamic irreversibility has energy-related and information-related contributions. A global cycle associated with the feedback-induced information flow would pump electrons against the bias voltage, which implements a Maxwell demon. 相似文献